Fault-Tolerant Mapping of a Mesh Network in a Flexible Hypercube
نویسنده
چکیده
The Flexible Hypercube FHN is an important variant of the Hypercube Hn and possesses many desirable properties for interconnection networks. This paper proposes a novel algorithm of fault-tolerant method for mapping a mesh network in a Flexible Hypercube. The main results obtained (1) a searching path of a FHN is including approximate to (n+1) nodes, where n= 2 log N ⎢ ⎥ ⎣ ⎦ . Therefore, there are O( ) faults, which can be tolerated. (2) Our results for the mapping methods are optimized mainly for balancing the processor and communication link loads. These results mean that the parallel algorithms developed by the structure of mesh network can be executed in a faulty FHN. The useful properties revealed and the algorithm proposed in this paper can find their way when the system designers evaluate a candidate network’s competence and suitability, balancing regularity and other performance criteria, in choosing an interconnection network. 2 log N ⎢⎣ ⎥⎦ Key-Words: Hypercube, Flexible Hypercube, Mesh Network, Fault-Tolerant, embedding
منابع مشابه
On Fault-Tolerant Embedding of Meshes and Tori in a Flexible Hypercube with Unbounded Expansion
The Flexible Hypercubes are superior to hypercube in terms of embedding a mesh and torus under faults. Therefore, this paper presented techniques to enhance the novel algorithm for fault-tolerant meshes and tori embedded in Flexible Hypercubes with node failures. The paper demonstrates that O(n 2 -log2m 2 ) faults can be tolerated and the algorithm is optimized mainly for balancing the proce...
متن کاملCAFT: Cost-aware and Fault-tolerant routing algorithm in 2D mesh Network-on-Chip
By increasing, the complexity of chips and the need to integrating more components into a chip has made network –on- chip known as an important infrastructure for network communications on the system, and is a good alternative to traditional ways and using the bus. By increasing the density of chips, the possibility of failure in the chip network increases and providing correction and fault tol...
متن کاملFault-Tolerant Meshes and Hypercubes with Minimal Numbers of Spares
Many parallel computers consist of processors connected in the form of a d-dimensional mesh or hypercube. Twoand three-dimensional meshes have been shown to be efficient in manipulating images and dense matrices, whereas hypercubes have been shown to be well suited to divide-andconquer algorithms requiring global communication. However, even a single faulty processor or communication link can s...
متن کاملFault Tolerant Hierarchical Interconnection Network for Parallel Computers (fth)
In this paper we introduce a new interconnection network Fault Tolerant Hierarchical Interconnection network for parallel Computers denoted by FTH(k, 1).This network has fault tolerant hierarchical structure which overcomes the fault tolerant properties of Extended hypercube(EH).This network has low diameter, constant degree connectivity and low message traffic density in comparisons with other...
متن کاملFault-Tolerant Meshes and Tori Embedded in a Faulty Supercube
Hypercubes, meshes, and tori are well known interconnection networks for parallel computing. The Supercube network is a generalization of the hypercube. The main advantage of this network is that it has the same connectivity and diameter as that of the hypercube without the constraint that the number of nodes be a power of 2. This paper proposes novel algorithms of fault-tolerant meshes and tor...
متن کامل